Generalisasi Bilangan Kromatik Pada Beberapa Kelas Graf Korona

For example is a chromatic number with the smallest integer so that graph has true vertex coloring k color. Chromatic still an interesting study which being studied for its development through coloring. Graph special case of labeling. Labeling here means, giving color to points at certain limit no two vertices have same This aims calculate in several classes graphs including , Based on results study, generalization class . Class and even n 4 odd n. Keywords: graph, coloring,